Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights.

نویسندگان

  • Naoki Masuda
  • Hiroyoshi Miwa
  • Norio Konno
چکیده

Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks proposed by Phys. Rev. Lett. 89, 258702 (2002)]. Power-law degree distributions, particularly with the dynamically stable scaling exponent 2, realistic clustering, and short path lengths are produced for many types of weight distributions. Thresholding mechanisms can underlie a family of real complex networks that is characterized by cooperativeness and the baseline scaling exponent 2. It contrasts with the class of growth models with preferential attachment, which is marked by competitiveness and baseline scaling exponent 3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geographical threshold graphs with small-world and scale-free properties.

Many real networks are equipped with short diameters, high clustering, and power-law degree distributions. With preferential attachment and network growth, the model by Barabási and Albert simultaneously reproduces these properties, and geographical versions of growing networks have also been analyzed. However, nongrowing networks with intrinsic vertex weights often explain these features more ...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

Scaling Properties of Complex Networks and Spanning Trees

We present a relation between three properties of networks: the fractal properties of the percolation cluster at criticality, the optimal path between vertices in the network under strong disorder (i.e., a broad distribution of edge weights) and the minimum spanning tree. Based on properties of the percolation cluster we show that the distance between vertices under strong disorder and on the m...

متن کامل

Scale-Free properties of weighted random graphs: Minimum Spanning Trees and Percolation

We study Erdös-Rényi random graphs with random weights associated with each link. In our approach, nodes connected by links having weights below the percolation threshold form clusters, and each cluster merges into a single node, thus generating a new “clusters network”. We show that this network is scale-free with λ = 2.5. Furthermore, we show that optimization causes the percolation threshold...

متن کامل

Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks

Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 70 3 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2004